New separation between s ( f ) and bs ( f ) Andris
نویسندگان
چکیده
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: bs(f) = 23s(f) 2 − 13s(f).
منابع مشابه
New separation between $s(f)$ and $bs(f)$
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: bs(f) = 2 3 s(f) − 1 3 s(f).
متن کاملNew upper bound on block sensitivity and certificate complexity in terms of sensitivity
Sensitivity [4, 5] and block sensitivity [9] are two important complexity measures of Boolean functions. A longstanding open problem in decision tree complexity, the “Sensitivity versus Block Sensitivity” question, proposed by Nisan and Szegedy [10] in 1992, is whether these two complexity measures are polynomially related, i.e., whether bs(f) = O(s(f)). We prove an new upper bound on block sen...
متن کاملA Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy [6], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-...
متن کاملAll Classical Adversary Methods are Equivalent for Total Functions
We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity fbs(f). That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. For partial functions, we show unbounded separations between fbs(f) and other adversary bo...
متن کاملSensitivity Versus Certificate Complexity of Boolean Functions
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of provin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011